On the Single-Parity Locally Repairable Codes with Multiple Repairable Groups
نویسندگان
چکیده
منابع مشابه
On Sequential Locally Repairable Codes
We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n, k, r, t)SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t(≤ t) erasures can be sequentially recovered, each one by r (2 ≤ r < k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovere...
متن کاملOptimal binary linear locally repairable codes with disjoint repair groups
In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However, most known constructions are over large fields with sizes close to the code length, which lead to the systems computationally expensive. Due to this, binary...
متن کاملBounds on Binary Locally Repairable Codes Tolerating Multiple Erasures
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers, which makes the systems computationally expensive and difficult to maintain. Here, we study linear locally repairable codes over the binary field, tolerating m...
متن کاملLocally Repairable Codes with Multiple $(r_{i}, \delta_{i})$-Localities
In distributed storage systems, locally repairable codes (LRCs) are introduced to realize low disk I/O and repair cost. In order to tolerate multiple node failures, the LRCs with (r, δ)-locality are further proposed. Since hot data is not uncommon in a distributed storage system, both Zeh et al. and Kadhe et al. focus on the LRCs with multiple localities or unequal localities (ML-LRCs) recently...
متن کاملLocally Repairable Codes with Functional Repair and Multiple Erasure Tolerance
We consider the problem of designing [n, k] linear codes for distributed storage systems (DSS) that satisfy the following (r, t)-local repair property: (r, t)-Local Repair Property: Any t′(≤ t) simultaneously failed nodes can be locally repaired, each with locality r. The parameters n, k, r, t are positive integers such that r < k < n and t ≤ n−k. We consider the functional repair model and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2018
ISSN: 2078-2489
DOI: 10.3390/info9110265